Incomparable Copies of a Poset in the Boolean Lattice
نویسندگان
چکیده
منابع مشابه
Incomparable Copies of a Poset in the Boolean Lattice
Let Bn be the poset generated by the subsets of [n] with the inclusion as relation and let P be a nite poset. We want to embed P into Bn as many times as possible such that the subsets in di erent copies are incomparable. The maximum number of such embeddings is asymptotically determined for all nite posets P as 1 t(P ) ( n bn/2c ) , where t(P ) denotes the minimal size of the convex hull of a ...
متن کاملAlmost Tiling of the Boolean Lattice with Copies of a Poset
Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and minimal element. Resolving a conjecture of Lonc, it was shown by Gruslys, Leader and Tomon that these conditions are sufficient as well. In th...
متن کاملOn Poset Boolean Algebras
Let 〈P,≤〉 be a partially ordered set. We define the poset Boolean algebra of P , and denote it by F (P ). The set of generators of F (P ) is {xp : p ∈ P}, and the set of relations is {xp ·xq = xp : p ≤ q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and 〈G,≤G〉 is well-founded. A wellgenerated algebra is superatomic. Theorem 1 Let 〈P,≤〉 be a...
متن کاملa swot analysis of the english program of a bilingual school in iran
با توجه به جایگاه زبان انگلیسی به عنوان زبانی بین المللی و با در نظر گرفتن این واقعیت که دولت ها و مسئولان آموزش و پرورش در سراسر جهان در حال حاضر احساس نیاز به ایجاد موقعیتی برای کودکان جهت یاد گیری زبان انگلیسی درسنین پایین در مدارس دو زبانه می کنند، تحقیق حاضر با استفاده از مدل swot (قوت ها، ضعف ها، فرصتها و تهدیدها) سعی در ارزیابی مدرسه ای دو زبانه در ایران را دارد. جهت انجام این تحقیق در م...
15 صفحه اولThe completion of a poset in a lattice of antichains
It is well known that given a poset, X, the lattice of order ideals of X, 〈I(X),⊆〉, is a completion of X via the order-embedding φ : X ↪→ I(X) where φ(x) = ↓x. Herein we define a lattice of antichains in X, 〈A(X),4〉, and prove it is isomorphic to 〈I(X),⊆〉. We establish the “join” and “meet” operations of the lattice, and present results for 〈A(X),4〉 analogous to standard results for 〈I(X),⊆〉, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2015
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-014-9342-8